Provable Secure Attribute-Based Proxy Signature Over Lattice Small Integer Solution Problem in Random Oracle Model
نویسندگان
چکیده
Current proxy signature schemes are mostly identity-based signatures that distinguish users by identity. This method faces some problems, such as identity information leakage and single access control. Attribute-based (ABPS) divides the signer’s into a collection of attributes; thus, users’ can be protected control become fine-grained. With development quantum computers, security based on traditional number theory problems is under threat. Therefore, we construct new attribute-based scheme lattice resist attacks. has properties both signatures, i.e., fine-grained strong undeniability properties. Moreover, small integer solution problem (SIS), our provably secure in random oracle model protects signer adaptive model.
منابع مشابه
A provable secure anonymous proxy signature scheme without random oracles
In order to protect the proxy signers’ privacy, many anonymous proxy signature schemes which are also called proxy ring signatures, have been proposed. Although the provable security in the random oracle model has received a lot of criticism, there is no provable secure anonymous proxy signature scheme without random oracles. In this paper, we propose the first provable secure anonymous proxy s...
متن کاملLattice-Based Ring Signature Scheme under the Random Oracle Model
Abstract: On the basis of the signatures scheme without trapdoors from lattice, which is proposed by Vadim Lyubashevsky in 2012, we present a new ring signature scheme from lattice. The proposed ring signature scheme is an extension of the signatures scheme without trapdoors. We proved that our scheme is strongly unforgeable against adaptive chosen message in the random oracle model, and proved...
متن کاملProvable Secure Multi-Proxy Signature Scheme without Bilinear Maps
Multi-proxy signature (MPS) allows an original signer to authorize a group of proxy signers as his proxy agent to sign co-operatively a message. As per the literature, the relative computation cost of a pairing is approximately more than ten times of the scalar multiplication over elliptic curve group which indicates that pairing is a very expensive operation. Moreover the map-to-point function...
متن کاملProvable Secure Generic Construction of Proxy Signature from Certifi- cate-based Signature
The certificate-based signature is an attractive cryptography primitive whose original motivation is to simplify certificate’s management and to eliminate key escrow problem. The proxy signature is another cryptography paradigm which permits an entity to delegate his signing rights to another. In this paper, we first note that certificate-based signatures and proxy signatures have something in ...
متن کاملAn Efficient Identity-based Signature from Lattice in the Random Oracle Model
We propose an efficient identity-based signature (IBS) scheme. The security of our scheme is proved in the random oracle model. Core technical components of our constructions are built on an arborist extends its control for a lattice to an arbitrary higher-dimensional extension. We use lattice's growth and lattice basis randomization securely to generate the user's secret key, and use trapdoor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12071619